Transition-Based Techniques for Non-Projective Dependency Parsing
نویسندگان
چکیده
منابع مشابه
Treebank Grammar Techniques for Non-Projective Dependency Parsing
An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly contextsensitive grammar formalisms. In this paper, we provide two key tools for this approach. First, we show how to reduce nonprojective dependency parsing to parsing with Linear Context-Free Rewriting...
متن کاملIncremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose problems in parsing with respect to both accuracy and efficiency. Using data from five different languages, we evaluate an incremental deterministic parser that derives non-projective dependency structures in O(n2) tim...
متن کاملNon-Deterministic Oracles for Unrestricted Non-Projective Transition-Based Dependency Parsing
We study non-deterministic oracles for training non-projective beam search parsers with swap transitions. We map out the spurious ambiguities of the transition system and present two non-deterministic oracles as well as a static oracle that minimizes the number of swaps. An evaluation on 10 treebanks reveals that the difference between static and non-deterministic oracles is generally insignifi...
متن کاملCorrective Modeling for Non-Projective Dependency Parsing
We present a corrective model for recovering non-projective dependency structures from trees generated by state-of-theart constituency-based parsers. The continuity constraint of these constituencybased parsers makes it impossible for them to posit non-projective dependency trees. Analysis of the types of dependency errors made by these parsers on a Czech corpus show that the correct governor i...
متن کاملDependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
We introduce dependency parsing schemata, a formal framework based on Sikkel’s parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Northern European Journal of Language Technology
سال: 2010
ISSN: 2000-1533
DOI: 10.3384/nejlt.2000-1533.10211